Deadlock-Free Parallel Processing
نویسندگان
چکیده
منابع مشابه
Oblivious Deadlock-Free Routing in a Faulty Hypercube
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parallel system, some processors are bound to fail, disrupting message routing. Second, one must avoid deadlock configurations in which messages permanently block one another. We present an efficient, oblivious, and deadlock...
متن کاملPart II: A Methodology for Developing Deadlock-Free Dynamic Network Reconfiguration Processes
Network Reconfiguration Processes Olav Lysne, Timothy Mark Pinkston and José Duato Abstract Dynamic network reconfiguration is defined as the process of changing from one routing function to another while the network remains up and running. The main challenge is in avoiding deadlock anomalies while keeping restrictions on packet injection and forwarding minimal. Current approaches either requir...
متن کاملDeadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
This paper considers the problem of electing a leader ina dynamic ring in which processors are permitted to fail and recoverduring election. e( n log n + I;, ) messages, when counting only messagessent by functional processors, are shown to be necessary and sufficientfor dynamic ring election, where I;v is the number of processor recoveriesexperienced.
متن کاملDeadlock - Free Routing in a Faulty Hypercube
In massively parallel computers, processors are often connected in a hypercube configuration. Each vertex in the hypercube represents a processor, and each edge represents a communication link. One problem in such a system is avoiding deadlock, a state where there is a cycle of processors, each waiting on the next indefinitely. A second problem is that in a system with many processors, some are...
متن کاملA Progressive Approach to Handling Message-Dependent Deadlock in Parallel Computer Systems
Handling deadlocks is essential for providing reliable communication paths between processing nodes in parallel computer systems. The existence of multiple message types and associated intermessage dependencies may cause message-dependent deadlocks in networks that are designed to be free of routing deadlock. Most methods currently used for dealing with messagedependent deadlocks require more s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1975